regexp/syntax.parser.stack (field)

50 uses

	regexp/syntax (current package)
		parse.go#L129: 	stack       []*Regexp // stack of parsed expressions
		parse.go#L202: 		for _, re := range p.stack {
		parse.go#L264: 		for _, re := range p.stack {
		parse.go#L325: 	p.stack = append(p.stack, re)
		parse.go#L340: 	n := len(p.stack)
		parse.go#L345: 	re1 := p.stack[n-1]
		parse.go#L346: 	re2 := p.stack[n-2]
		parse.go#L362: 	p.stack = p.stack[:n-1]
		parse.go#L418: 	n := len(p.stack)
		parse.go#L422: 	sub := p.stack[n-1]
		parse.go#L433: 	p.stack[n-1] = re
		parse.go#L481: 	i := len(p.stack)
		parse.go#L482: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L485: 	subs := p.stack[i:]
		parse.go#L486: 	p.stack = p.stack[:i]
		parse.go#L500: 	i := len(p.stack)
		parse.go#L501: 	for i > 0 && p.stack[i-1].Op < opPseudo {
		parse.go#L504: 	subs := p.stack[i:]
		parse.go#L505: 	p.stack = p.stack[:i]
		parse.go#L1088: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L1092: 	n := len(p.stack)
		parse.go#L1096: 	return p.stack[0], nil
		parse.go#L1378: 	n := len(p.stack)
		parse.go#L1379: 	if n >= 3 && p.stack[n-2].Op == opVerticalBar && isCharClass(p.stack[n-1]) && isCharClass(p.stack[n-3]) {
		parse.go#L1380: 		re1 := p.stack[n-1]
		parse.go#L1381: 		re3 := p.stack[n-3]
		parse.go#L1385: 			p.stack[n-3] = re3
		parse.go#L1389: 		p.stack = p.stack[:n-1]
		parse.go#L1394: 		re1 := p.stack[n-1]
		parse.go#L1395: 		re2 := p.stack[n-2]
		parse.go#L1400: 				cleanAlt(p.stack[n-3])
		parse.go#L1402: 			p.stack[n-2] = re1
		parse.go#L1403: 			p.stack[n-1] = re2
		parse.go#L1415: 		p.stack = p.stack[:len(p.stack)-1]
		parse.go#L1419: 	n := len(p.stack)
		parse.go#L1423: 	re1 := p.stack[n-1]
		parse.go#L1424: 	re2 := p.stack[n-2]
		parse.go#L1425: 	p.stack = p.stack[:n-2]